On Cryptographically Secure Vectorial Boolean Functions
نویسندگان
چکیده
In this paper, we show the rst method to construct vecto-rial bent functions which satisfy both the largest degree and the largest number of output bits simultaneously. We next apply this method to construct balanced vectorial Boolean functions which have larger non-linearities than previously known constructions.
منابع مشابه
Practical Bijective S-box Design
Vectorial Boolean functions are usually called Substitution Boxes (S-Boxes) and are used as basic component of block ciphers in Cryptography. The ciphers that are Substitution-permutation networks use bijective S-Boxes i.e., Boolean permutations. S-Boxes with low differential uniformity and high nonlinearity are considered as cryptographically strong. In this paper we study some properties of S...
متن کاملHaar Spectrum of Bent Boolean Functions
Bent Boolean functions play a very significant role in the design of strong symmetric cryptosystems. In this paper, we present an analysis of Bent functions in the Haar domain. We first present a brief overview of Bent Boolean functions and then derive expressions for the Haar spectrum of Bent functions. The Haar spectral coefficients of Bent functions are given in two ways namely; in terms of ...
متن کاملOn the Primary Constructions of Vectorial Boolean Bent Functions∗
Vectorial Boolean bent functions, which possess the maximal nonlinearity and the minimum differential uniformity, contribute to optimum resistance against linear cryptanalysis and differential cryptanalysis for the cryptographic algorithms that adopt them as nonlinear components. This paper is devoted to the new primary constructions of vectorial Boolean bent functions, including four types: ve...
متن کاملSignal Processing Techniques in Cryptography
Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness characteristics of cryptographic sequences are analyzed, resulting in new methods for constructing sequences with high linear complexity. Connections between nonlinear complexity and other cryptographic criteria are also established, whereas a new recursive algorithm for efficiently computing the minimal ...
متن کاملOn the Existence and Constructions of Vectorial Boolean Bent Functions
Recently, one of the hot topics on vectorial Boolean bent functions is to construct vectorial Boolean bent functions in the form Tr m(P (x)) from Boolean bent functions in the form Tr 1 (P (x)), where P (x) ∈ F2n [x]. This paper first presents three constructions of vectorial Boolean bent functions in the form Tr m(P (x)), where two of them give answers to two open problems proposed by Pasalic ...
متن کامل